Concentration of Lipschitz Functionals of Determinantal and Other Strong Rayleigh Measures

نویسندگان

  • Robin Pemantle
  • Yuval Peres
چکیده

Let fX1; : : : ; Xng be a collection of binary valued random variables and let f : f0; 1g n ! R be a Lipschitz function. Under a negative dependence hypothesis known as the strong Rayleigh condition, we show that f Ef satis es a concentration inequality. The class of strong Rayleigh measures includes determinantal measures, weighted uniform matroids and exclusion measures; some familiar examples from these classes are generalized negative binomials and spanning tree measures. For instance, any Lipschitz-1 function of the edges of a uniform spanning tree on vertex set V (e.g., the number of leaves) satis es the Gaussian concentration inequality P(f Ef a) exp a 8 jV j . We also prove a continuous version for concentration of Lipschitz functionals of a determinantal point process.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fast Sampling for Strongly Rayleigh Measures with Application to Determinantal Point Processes

In this note we consider sampling from (non-homogeneous) strongly Rayleigh probability measures. As an important corollary, we obtain a fast mixing Markov Chain sampler for Determinantal Point Processes.

متن کامل

Negative Dependence and the Geometry of Polynomials

We introduce the class of strongly Rayleigh probability measures by means of geometric properties of their generating polynomials that amount to the stability of the latter. This class contains e.g. product measures, uniform random spanning tree measures, and large classes of determinantal probability measures and distributions for symmetric exclusion processes. We show that strongly Rayleigh m...

متن کامل

Multivariate CLT follows from strong Rayleigh property

Let (X1, . . . , Xd) be a random nonnegative integer vector. Many conditions are known to imply a central limit theorem for a sequence of such random vectors, for example, independence and convergence of the normalized covariances, or various combinatorial conditions allowing the application of Stein’s method, couplings, etc. Here, we prove a central limit theorem directly from hypotheses on th...

متن کامل

Monte Carlo Markov Chain Algorithms for Sampling Strongly Rayleigh Distributions and Determinantal Point Processes

Strongly Rayleigh distributions are natural generalizations of product and determinantal probability distributions and satisfy the strongest form of negative dependence properties. We show that the “natural” Monte Carlo Markov Chain (MCMC) algorithm mixes rapidly in the support of a homogeneous strongly Rayleigh distribution. As a byproduct, our proof implies Markov chains can be used to effici...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Combinatorics, Probability & Computing

دوره 23  شماره 

صفحات  -

تاریخ انتشار 2014